Aggregate Queries in NoSQL Cloud Data Stores

نویسنده

  • Plamen Nikolov
چکیده

This thesis work describes the design and implementation of an aggregate view maintenance mechanism for web applications in the Cloud. Maintaining consistent views and ensuring fault and partition tolerance is generally hard as the CAP theorem postulates that these three properties cannot hold simultaneously. Nevertheless, web application transactions are often characterized by short-lived transactions touching only a few data items. Specific examples are shopping cart updates, user name and password look-ups, and online visitor statistics. The small sized updates allow for an efficient aggregate view maintenance solution based on incremental updates via change tables. The change table mechanism can be readily implemented at a transaction coordinator node which can carry out the entire computation because of the small-sized view change tables. This thesis elaborates on using the two-phase commit protocol and simple equi-join queries to implement a synchronous and asynchronous version of the change table algorithm. In this work we will argue that the heavy workloads introduced by the synchronous approach can be decreased by relaxing the view freshness requirements. Thus, the performance of the proposed mechanism can be controlled by exploiting the whole consistency range from immediate updates to deferred refreshing which can be carried out at arbitrary time intervals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consistent Join Queries in Cloud Data Stores

NoSQL Cloud data stores provide scalability and high availability properties for web applications, but do not support complex queries such as joins. Developers must therefore design their programs according to the peculiarities of NoSQL data stores rather than established software engineering practice. This results in complex and error-prone code, especially when it comes to subtle issues such ...

متن کامل

Order preserving encryption for wide column stores

Order-preserving encryption (OPE) allows encrypting without losing information about the order relation between the encrypted data items. Thus, the execution of compare, order and grouping operations can be done like on plaintext data. In particular it allows databases to do range queries over encrypted data, which is a useful feature especially for cloud databases that usually run in untrusted...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

Design and Implementation of the CloudMdsQL Multistore System

The blooming of different cloud data management infrastructures has turned multistore systems to a major topic in the nowadays cloud landscape. In this paper, we give an overview of the design of a Cloud Multidatastore Query Language (CloudMdsQL), and the implementation of its query engine. CloudMdsQL is a functional SQL-like language, capable of querying multiple heterogeneous data stores (rel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011